Extended Algorithms for Sample Rate Conversion
نویسندگان
چکیده
The idea of software radio (SWR) implies the capability of changing the air-interface just by down-loading the respective software. Since analog components (e.g., for prefiltering and digitization) are difficult to parameterize these tasks have to be moved to the digital domain, or have to be done in a standard independent way. In such receivers the task of sample rate conversion (SRC) is essential and has to be performed in an adaptable manner. Polynomial filters are a very suitable choice for sample rate conversion. Since the support (length) of the filter determines the effort and costs implementing this filter, minimizing the support is an important task. It will be shown that using a more general approach to interpolation leads to filters with minimal support for a given accuracy. This results in a considerable reduction of the effort.
منابع مشابه
Sampling Rate Conversion in the Discrete Linear Canonical Transform Domain
Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...
متن کاملEstimation of LOS Rates for Target Tracking Problems using EKF and UKF Algorithms- a Comparative Study
One of the most important problem in target tracking is Line Of Sight (LOS) rate estimation for using from PN (proportional navigation) guidance law. This paper deals on estimation of position and LOS rates of target with respect to the pursuer from available noisy RF seeker and tracker measurements. Due to many important for exact estimation on tracking problems must target position and Line O...
متن کاملComparison of Simulated Annealing and Electromagnetic Algorithms for Solution of Extended Portfolio Model
This paper presents two meta-heuristic algorithms to solve an extended portfolio selection model. The extended model is based on the Markowitz's Model, aiming to minimize investment risk in a specified level of return. In order to get the Markowitz model close to the real conditions, different constraints were embedded on the model which resulted in a discrete and non-convex solution space. ...
متن کاملSignal-Flow-Graph Identities for Structural Transformations in Multirate Systems
Signal-flow-graph (SFG) transformations by means of identities are frequently used to obtain efficient structures. In contrast to timedomain approaches these transformations are graphical and therefore easier to handle. In this paper well-known noble identities [2] for multirate signal processing are revisited and extended. To this end upand downsamplers with arbitrary integer phase shifts are ...
متن کاملA Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کامل